Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms
نویسندگان
چکیده
We do what the title promises, and as a bonus, we get much simplified versions of these algorithms, that do not make any explicit mention of Gosper’s algorithm. © 2004 Elsevier Ltd. All rights reserved.
منابع مشابه
Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملLittle q-Legendre polynomials and irrationality of certain Lambert series
Certain q-analogs hp(1) of the harmonic series, with p = 1/q an integer greater than one, were shown to be irrational by Erdős [9]. In 1991–1992 Peter Borwein [4] [5] used Padé approximation and complex analysis to prove the irrationality of these q-harmonic series and of q-analogs lnp(2) of the natural logarithm of 2. Recently Amdeberhan and Zeilberger [1] used the qEKHAD symbolic package to f...
متن کاملHow to Extend Károlyi and Nagy’s BRILLIANT Proof of the Zeilberger-Bressoud q-Dyson Theorem in order to Evaluate ANY Coefficient of the q-Dyson Product
Shalosh B. EKHAD and Doron ZEILBERGER Dedicated to Freeman Dyson (b. Dec. 15, 1923) on his 89 23 -th birthday Very Important: As in all our joint papers, this document, the human-readable article, is not the main point, but its Maple implementation, qDYSON, written by DZ, available from http://www.math.rutgers.edu/~zeilberg/tokhniot/qDYSON . The ‘front’ of this article http://www.math.rutgers.e...
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملA SHORT PROOF OF THE ZEILBERGER-BRESSOUD q-DYSON THEOREM
We give a formal Laurent series proof of Andrews’s q-Dyson Conjecture, first proved by Zeilberger and Bressoud.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 39 شماره
صفحات -
تاریخ انتشار 2005